A Multipopulation PSO Based Memetic Algorithm for Permutation Flow Shop Scheduling
نویسندگان
چکیده
منابع مشابه
A Multipopulation PSO Based Memetic Algorithm for Permutation Flow Shop Scheduling
The permutation flow shop scheduling problem (PFSSP) is part of production scheduling, which belongs to the hardest combinatorial optimization problem. In this paper, a multipopulation particle swarm optimization (PSO) based memetic algorithm (MPSOMA) is proposed in this paper. In the proposed algorithm, the whole particle swarm population is divided into three subpopulations in which each part...
متن کاملA cloud-based simulated annealing algorithm for order acceptance problem with weighted tardiness penalties in permutation flow shop scheduling
Make-to-order is a production strategy in which manufacturing starts only after a customer's order is received; in other words, it is a pull-type supply chain operation since manufacturing is carried out as soon as the demand is confirmed. This paper studies the order acceptance problem with weighted tardiness penalties in permutation flow shop scheduling with MTO production strategy, the objec...
متن کاملNNMA: An effective memetic algorithm for solving multiobjective permutation flow shop scheduling problems
The permutation flow shop scheduling problem is addressed in this paper. Two objectives, minimization of makespan and total flow time, are considered. We propose a memetic algorithm, called NNMA, by integrating a general multiobjective evolutionary algorithm (NSGA-II) with a problem-specific heuristic (NEH). We take NEH as a local improving procedure in NNMA and propose several adaptations incl...
متن کاملA Novel Hybrid Algorithm for Permutation Flow Shop Scheduling
In the present scenario the recent engineering and industrial built-up units are facing hodgepodge of problems in a lot of aspects such as machining time, electricity, man power, raw material and customer’s constraints. The job-shop scheduling is one of the most significant industrial behaviours, particularly in manufacturing planning. This paper proposes the permutation flow shop sequencing pr...
متن کاملSolving Permutation Flow Shop Scheduling Problem with a Cooperative Multi-swarm PSO Algorithm ⋆
In this paper, an Electoral Cooperative Particle Swarm Optimization (ECPSO) based on several subswarms is presented to solving the Permutation Flow Shop Scheduling Problem (PFSSP). In the proposed algorithm, several strategies are employed to avoid falling into local optimum, improve the diversity and achieve better solution. Firstly, a electoral swarm is generated by the voting of primitive su...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Scientific World Journal
سال: 2013
ISSN: 1537-744X
DOI: 10.1155/2013/387194